An Effective Reliability Efficient Algorithm for Enhancing the Overall Performance of Distributed Computing System

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Effective Reliability Efficient Algorithm for Enhancing the Overall Performance of Distributed Computing System

Distributed computing refers to the use of distributed systems to solve computational problems. A distributed computing system consists of multiple computers that communicate through a computer network. The computers that are in a distributed computing system can be physically close together and connected by a local network, or they can be geographically distant and connected by a wide area net...

متن کامل

Proposing an Efficient Software-Based Method for Enhancing the Reliability of Critical Application Robot

Robots play such remarkable roles in humans’ modern lives that performing many tasks without them isimpossible. Using robotic systems is gradually increasing the tasks allocated to them and they are becomingmore complex and critical. Software reliability is one of the most significant requirements of robots. Forenhancing reliability, systems should be inherently designed to be tolerable of soft...

متن کامل

An Efficient Algorithm for Reliability Lower Bound of Distributed Systems

The reliability of distributed systems and computer networks have been modeled by a probabilistic network or a graph G. Computing the residual connectedness reliability (RCR), denoted by R(G), under the node fault model is very useful, but is an NP−hard problem. Since it may need exponential time of the network size to compute the exact value of R(G), it is important to calculate its tight appr...

متن کامل

An Efficient Distributed Algorithm for Computing Minimal Hitting Sets

Computing minimal hitting sets for a collection of sets is an important problem in many domains (e.g., Spectrum-based Fault Localization). Being an NP-Hard problem, exhaustive algorithms are usually prohibitive for real-world, often large, problems. In practice, the usage of heuristic based approaches trade-off completeness for time efficiency. An example of such heuristic approaches is STACCAT...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computer Applications

سال: 2013

ISSN: 0975-8887

DOI: 10.5120/14114-2163